ADAPTIVE HARMONY SEARCH FOR OPTIMIZING CONSTRAINED RESOURCE ALLOCATION PROBLEM
نویسندگان
چکیده
منابع مشابه
Search-Based Techniques for Optimizing Software Project Resource Allocation
In software development, testing and maintenance, as in other large scale engineering activities, effective project planning is essential. Failure to plan and/or poor planning can cause delays and costs that, given timing and budget constraints, are often unacceptable, leading to business– critical failures. Traditional tools such as the Project Evaluation and Review Technique (PERT), the Criti...
متن کاملresource-constrained scheduling of construction projects using the harmony search algorithm
during the implementation, construction projects usually encounter situation that considerably affects the project scheduling and cost. this study aims at using an improved version of the harmony search algorithm (hsa) to schedule resource constrained construction projects. this model is formulated as a global optimization problem. it will determine the duration of each activity to minimize the...
متن کاملOptimizing Dynamic Resource Allocation
We present a formulation, solution method, and program acceleration techniques for two dynamic control scenarios, both with the common goal of optimizing resource allocations. These approaches allocate resources in a non-myopic way, accounting for long-term impacts of current control decisions via nominal belief-state optimization (NBO). In both scenarios, the solution techniques are paralleliz...
متن کاملResource-Constrained Adaptive Search and Tracking for Sparse Dynamic Targets
This paper considers the problem of resource-constrained and noise-limited localization and estimation of dynamic targets that are sparsely distributed over a large area. We generalize an existing framework [Bashan et al, 2008] for adaptive allocation of sensing resources to the dynamic case, accounting for timevarying target behavior such as transitions to neighboring cells and varying amplitu...
متن کاملLocal Search for the Resource Constrained Assignment Problem
The resource constrained assignment problem (RCAP) is to find a minimal cost cycle partition in a directed graph such that a resource constraint is fulfilled. The RCAP has its roots in an application that deals with the covering of a railway timetable by rolling stock vehicles. Here, the resource constraint corresponds to maintenance constraints for rail vehicles. Moreover, the RCAP generalizes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computing
سال: 2018
ISSN: 2312-5381,1727-6209
DOI: 10.47839/ijc.17.4.1148